Fault-Tolerant Scheduling Algorithm With Re-Allocation for Divisible Task
نویسندگان
چکیده
منابع مشابه
On the Cost of Task Re-Scheduling in Fault-Tolerant Task Parallel Computations
Fault tolerance is still an “hot” topic in the context of Grid computing. There exist several solutions and techniques to face this issue, some of them inherited from the fault tolerance research, some other introduced in the context of Grid computing. Anyway, poor work has been done in providing such fault tolerance strategies in a lightweight, scalable and analyzable way. In this technical re...
متن کاملFault Tolerant Mechanism Design for General Task Allocation
We study a general task allocation problem, involving multiple agents that collaboratively accomplish tasks and where agents may fail to successfully complete the tasks assigned to them (known as execution uncertainty). The goal is to choose an allocation that maximises social welfare while taking their execution uncertainty into account (i.e., fault tolerant). To achieve this, we show that the...
متن کاملImproved Fault Tolerant Elastic Scheduling Algorithm (IFESTAL)
The existing fault tolerant models focus on the failure of host. If a host fails, the copies of tasks on this host will fail to finish. At one time instant, at most one host may encounter a failure, that is to say, if the primaries of tasks fail, the backups can always finish successfully before another host fails. Failures can be either transient or permanent, and are independent, affecting on...
متن کاملDynamic Replication of Fault-Tolerant Scheduling Algorithm
In order to reduce the impact on the grid scheduling caused by the resource error, for complex dependent tasks, designed a dynamic replication of fault-tolerant scheduling algorithm (DRFT). This algorithm build task model by applying hypergraph theory, using primary-backup task as backup mode, take the active execution mode combined with the passive execution mode to perform the backup task, se...
متن کاملReliable Fault-Tolerant Multi-bus Scheduling Algorithm
In this paper, we propose a fault-tolerant scheduling real-time embedded system. This scheduling algorithm is dedicated to multi-bus heterogeneous architectures, which take as input a given system description and a given fault hypothesis. It is based on a data fragmentation and passive redundancy, which allow fast fault detection/retransmission and efficient use of buses. This scheduling approa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2881268